Control of condorcet voting: complexity and a relation-algebraic approach

We study the constructive variant of the control problem for Condorcet voting, where control is done by deleting voters. We prove that this problem remains NP-hard for the Condorcet-consistent voting rule Uncovered Alternatives. Furthermore, we develop a relation-algebraic model of Condorcet voting and relation-algebraic specifications of the dominance relation and the solutions of the control problem.